from collections import defaultdict, deque
from functools import lru_cache
from heapq import heappush, heappop
from typing import Counter
from bisect import bisect_right, bisect_left
import math
hpop = heappop
hpush = heappush
def solution():
n = int(input())
arr = []
for _ in range(n):
arr.append(int(input()))
time = n + arr[0]
for i in range(1, len(arr)):
time += abs(arr[i] - arr[i-1]) + 1
print(time)
def main():
t = 1
for _ in range(t):
solution()
main()
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n; cin >> n;
int h[n];
for(int i=0; i<n; i++) cin>>h[i];
int time =0;
time += h[0];
time++; //eat nut on first tree
for(int i=1; i<n; i++) {
if(h[i] > h[i-1]) {
time += h[i]-h[i-1];
}
else time += h[i-1] - h[i];
time++; //jump to next tree
time++; //eat nut on the current tree
}
cout<<time<<endl;
return 0;
}791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |